#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=600;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL dis[maxn][maxn];
LL ans[maxn],b[maxn],c[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++){
     for(LL j=1;j<=n;j++){
        cin>>dis[i][j];
     }
  }
  for(LL i=1;i<=n;i++) cin>>b[i];
  for(LL i=1;i<=n;i++) c[i]=b[n-i+1];
  for(LL k=1;k<=n;k++){
    LL sum=0;
    for(LL i=1;i<=n;i++){
        for(LL j=1;j<=n;j++){
            dis[c[i]][c[j]]=min(dis[c[i]][c[k]]+dis[c[k]][c[j]],dis[c[i]][c[j]]);
            if(i<=k&&j<=k) sum+=dis[c[i]][c[j]];
        }
    }
    ans[k]=sum;
  }
  for(LL i=n;i>=1;i--){
    cout<<ans[i]<<" ";
  }
  cout<<"\n";
return 0;
}
